#include"Sort.h"
void test1()
{
	//int arr[] = { 2,5,9,0,6,4,1,3,8,7 };
	int arr[] = { 2,0,4,6,7,8,9,3 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	PrintArray(arr, sz);
	MergeSortNonR(arr, sz);
	PrintArray(arr, sz);
}
void test2()
{
	int N = 30;
	int* arr1 = (int*)malloc(sizeof(int) * N);
	if (arr1 == NULL)
	{
		perror("malloc failed");
		exit(-1);
	}
	int i = 0;
	for (i = 0; i < N; i++)
	{
		arr1[i] = rand() % 100;
	}
	PrintArray(arr1, N);
	MergeSort(arr1, N);
	PrintArray(arr1, N);
}
int main()
{
	srand((unsigned)time(NULL));
	test1();
	//test2();
	return 0;
}
